منابع مشابه
Task Scheduling for Multiprocessor Systems with Autonomous Performance-Optimizing Control
In all non-blocking non-preemptive (NBNP) scheduling techniques for a multicomputer system for processor allocation, Largest-Job-First (LJF) technique proves to possess a unique characteristic in utilizing as many processors as possible compared to others such as First-Come-First-Serve (FCFS) and Smallest-Job-First (SJF). However, a jobbypass limit that is preset to preclude the starvation prob...
متن کاملCOVID- 19: disease, progress, control and their relation with sex
Worldwide epidemic had a specific role on human health and economic; Corona, for example, as a huge pandemic had an expand effect on human health, social relation, economic, politic and environment with severe respiratory disorder and high mortality rate in the world. Due to importance of SARS-Cov-2, the present paper deals with the route of transmission, their relation with sex, prevention and...
متن کاملOptimization Task Scheduling Algorithm in Cloud Computing
Since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. Presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. This rese...
متن کاملScheduling task systems with resources
Minimum execution time scheduling of task systems with resources has been the subject of several papers over the past few years. The model used for much of this work assumes that the resources in the system are continuous. That is, there is one unit of each resource, and a task may require any portion of that unit during its execution. While this is a reasonable assumption for certain bin packi...
متن کاملJobshop Scheduling with task intervals
This paper presents a technique for scheduling based on sets of tasks. Used within a branch & bound algorithm, it cuts branches very eeciently. It is thus well adapted for proofs of optimality. This technique solves typical hard 10 10 problems within a few thousand backtracks and is also adapted to large problems. LA21, a 15 10 problem open since 1984 is solved and a new bound is given for LA29...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IISE Transactions
سال: 2017
ISSN: 2472-5854,2472-5862
DOI: 10.1080/24725854.2017.1380334